Ghi chú Bài toán người bán hàng

  1. 1 2 3 4 M. Jünger, G. Reinelt and G. Rinaldi (1994). "The Traveling Salesman Problem," in Ball, Magnanti, Monma and Nemhauser (eds.), Handbook on Operations Research and the Management Sciences North Holland Press, 225-330.
  2. ↑ D. S. Johnson (1990) "Local Optimization and the Traveling Salesman Problem," Proc. 17th Colloquium on Automata, Languages and Programming, Springer Verlag, 446-461.
  3. ↑ J.V. Potvin (1996) "Genetic Algorithms for the Traveling Salesman Problem", Annals of Operations Research 63, 339-370.
  4. ↑ J.V. Potvin (1993), "The Traveling Salesman Problem: A Neural Network Perspective", INFORMS Journal on Computing 5 328-348.
  5. ↑ C.N. Fiechter (1990) "A Parallel Tabu Search Algorithm for Large Scale Traveling Salesman Problems" Working Paper 90/1 Department of Mathematics, École Polytechnique Fédérale de Lausanne, Switzerland.
  6. ↑ D. S. Johnson and C.H. Papadimitriou (1985). "Performance Guarantees for Heuristics," in The Traveling Salesman Problem, Lawler, Lenstra, Rinooy Kan and Shmoys, eds., John Wiley, 145-180.
  7. ↑ R. Karp and J.M. Steele (1985). "Probabilistic Analysis of Heuristics," in The Traveling Salesman Problem, Lawler, Lenstra, Rinnooy Kan and Shmoys, eds., John Wiley, 181-205.
  8. ↑ B.L. Golden and W.R. Stewart (1985). "Empirical Analysis of Heuristics," in The Traveling Salesman Problem, Lawler, Lenstra, Rinooy Kan and Shmoys, eds., John Wiley, 207-250.
  9. 1 2 D. Miller and J. Pekny (1991). "Exact Solution of Large Asymmetric Traveling Salesman Problems," Science 251, 754-761.
  10. ↑ ] M.W. Padberg and M. Grötschel (1985). "Polyhedral Computations," in The Traveling Salesman Problem, Lawler, Lenstra, Rinooy Kan and Shmoys, eds., John Wiley, 307-360.
  11. ↑ T. Christof and G. Reinelt, (1995) "Parallel cutting plane generation for the TSP in Parallel Programming and Applications (P. Fritzson, L. Finmo, eds.) IOS Press, 163-169.
  12. ↑ D. Applegate, R.E. Bixby, V. Chvatal, and W. Cook (1998) "On the solution of traveling salesman problems" Documenta Mathematica - Extra Volume, ICM III 645-658.
  13. ↑ RE Bland và DF Shallcross (1987). "Đi du lịch lớn người bán hàng vấn đề phát sinh từ thí nghiệm trong X-quang tinh thể: Báo cáo sơ bộ về tính toán," Báo cáo kỹ thuật số 730, Trường OR / IE, Đại học Cornell, Ithaca, New York.
  14. 1 2 BL Golden, L. Levy và R. Vohra (1987). "Vấn đề Orienteering," Hải quân nghiên cứu Logistics 34, 307-318.
  15. ↑ HD Ratliff và AS Rosenthal (1981). "Trật tự hái trong một kho hình chữ nhật: Một trường hợp khả năng giải quyết cho vấn đề người bán hàng Du lịch," PDRC Báo cáo Dòng số 81-10. Viện Công nghệ Georgia, Atlanta, Georgia.
  16. ↑ E. Balas (1989). "Giải thưởng Du lịch Thu vấn đề người bán hàng," Mạng 19, 621-636.
  17. ↑ M. Dorigo, V. Maniezzo, et A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics--Part B, volume 26, numéro 1, pages 29-41, 1996.
  18. ↑ Arash Asadpour, Michel X. Goemans, Aleksander Mądry, Shayan Oveis Gharan, Amin Saberi (2010). “An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem” (PDF). Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA. tr. 379–389. 
  19. ↑ Satish B. Rao, Warren D. Smith (1998). “Approximating geometrical graphs via "spanners" and "banyans"”. Proceedings of the thirtieth annual ACM symposium on Theory of computing (STOC '98). ACM, New York, NY, USA. tr. 540–550. doi:10.1145/276698.276868. 

Tài liệu tham khảo

WikiPedia: Bài toán người bán hàng http://www.dna-evolutions.com/dnaappletsample.html http://www.visualbots.com/index.htm http://cs.felk.cvut.cz/~xobitko/ga/tspexample.html http://www.iwr.uni-heidelberg.de/groups/comopt/sof... http://www.tsp.gatech.edu/concorde.html http://www.tsp.gatech.edu/index.html http://iris.gmu.edu/~khoffman/papers/trav_salesman... http://www.adaptivebox.net/research/bookmark/tspco... http://www.concept67.net/blog/?page_id=180 http://www.e-nuts.net/en/self-organizing-map